The numerical duplication of a numerical semigroup
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAddition Behavior of a Numerical Semigroup 23
— In this work we study some objects describing the addition behavior of a numerical semigroup and we prove that they uniquely determine the numerical semigroup. We then study the case of Arf numerical semigroups and find some specific results. Résumé (Comportement de l’addition dans un semi-groupe numérique). — Dans ce travail, nous étudions des objets qui décrivent le comportement de l’additi...
متن کاملThe Numerical Semigroup of Phrases' Lengths in a Simple Alphabet
Let A be an alphabet with two elements. Considering a particular class of words (the phrases) over such an alphabet, we connect with the theory of numerical semigroups. We study the properties of the family of numerical semigroups which arise from this starting point.
متن کاملThe Complexity of the Numerical Semigroup Gap Counting Problem
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined as a positive integer that does not belong to the numerical semigroup. The computation of gaps of numerical semigroups has been actively studied from the 19t...
متن کاملThe numerical semigroup of the integers which are bounded by a submonoid of N2
Let N be the set of nonnegative integers. A submonoid of (N,+) is a subset M of N that is closed for the addition and that contains the zero element. A numerical semigroup is a submonoid S of (N,+) such that N \ S is finite. Definition 1 Let S be a numerical semigroup. The Frobenius number of S is F(S ) = max(Z \ S ) and the genus of S is g(S ) = (N \ S ). Definition 2 A Frobenius variety is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2012
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-012-9451-x